Private Mutual Authentication and Conditional Oblivious Transfer
نویسندگان
چکیده
A bi-directional Private Authentication, or Unlinkable Secret Handshake, allows two parties to authenticate each other as certified by given certification authorities (i.e. affiliated with given groups), in a mutually private way, in the sense that the protocol leaks no information about either participant to a party which does not satisfy that participant’s authentication policy. In particular, the protocol hides what group this participant belongs to, and protocol instances involving the same participant are unlinkable. We construct the first realization of such private authentication using O(1) exponentiations and bilinear maps, secure under Strong Diffie-Hellman and Decisional Linear assumptions. Our protocols rely on a novel technical tool, a family of efficient Private Conditional Oblivious Transfer (COT) protocols, secure under DDH, for languages defined by modular arithmetic constraints (e.g. equality, inequality, sums, products) on discrete-log representations of some group elements. (Recall that (w1, ..., wn) is a representation ofC in bases (g1, ..., gn) if C = g1 1 ...g wn n .) A COT protocol for language L allows sender S to encrypt message m “under” statement x so that receiver R gets m only if R holds a witness for membership of x in L, while S learns nothing. A private COT for L hides not only messagem but also statement x from any R that does not know a witness for x in L.
منابع مشابه
A Novel Unconditionally Secure Oblivious Polynomial Evaluation Protocol
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P , and a receiver whose input is a value x. At the end of the protocol, the receiver learns P (x) and nothing more about P , while the sender remains oblivious of both x and P (x). It is used as a primitive in many applications including protocols for private comparison of data, for mutual...
متن کاملOblivious Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P , and a receiver whose input is a value α. At the end of the protocol the receiver learns P (α) and the sender learns nothing. We describe efficient constructions for this protocol, which are based on new intractability assumptions that are closely related to noisy polynomial reconstructi...
متن کاملA Novel k-out-of-n Oblivious Transfer Protocol from Bilinear Pairing
As traditional oblivious transfer protocols are treated as cryptographic primitives in most cases, they are usually executed without the consideration of possible attacks, e.g., impersonation, replaying, and man-in-the-middle attacks. Therefore, when these protocols are applied in certain applications, such as mental poker game playing and fairly contracts signing, some extra mechanisms must be...
متن کاملAn Efficient Secure Oblivious Transfer
As traditional oblivious transfer protocols are treated as a cryptographic primitive, they are usually executed without the consideration of possible attacks, e.g., impersonation, replaying, and man-in-the-middle attacks. Therefore, when these protocols are applied in certain applications such as mental poker playing, some necessary mechanism must be executed first to ensure the security of sub...
متن کاملNew Communication-Efficient Oblivious Transfer Protocols Based on Pairings
We construct two simple families of two-message (n, 1)-oblivious transfer protocols based on degree-t homomorphic cryptosystems with the communication of respectively 1 + dn/te and 3 + dn/(t + 1)e ciphertexts. The construction of both families relies on efficient cryptocomputable conditional disclosure of secret protocols; the way this is done may be of independent interest. The currently most ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009